Computing Approximate (Symmetric Block) Rational Krylov Subspaces without Explicit Inversion

نویسندگان

  • Thomas Mach
  • Miroslav S. Pranić
  • Raf Vandebril
چکیده

It has been shown that approximate extended Krylov subspaces can be computed –under certain assumptions– without any explicit inversion or system solves. Instead the necessary products A−1v are obtained in an implicit way retrieved from an enlarged Krylov subspace. In this paper this approach is generalized to rational Krylov subspaces, which contain besides poles at infinite and zero also finite non-zero poles. Also an adaption of the algorithm to the block and the symmetric case is presented. For all variants of the algorithm numerical experiments underpin the power of the new approach. Rational Krylov subspaces can be used, e.g., to approximate matrix functions or the solutions of matrix equations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Approximate Extended Krylov Subspaces without Explicit Inversion

It will be shown that extended Krylov subspaces –under some assumptions– can be retrieved without any explicit inversion or system solves involved. Instead we do the necessary computations of A−1v in an implicit way using the information from an enlarged standard Krylov subspace. It is well-known that both for classical and extended Krylov spaces, direct unitary similarity transformations exist...

متن کامل

A Rational Krylov Toolbox for MATLAB

1 Overview Thank you for your interest in the Rational Krylov Toolbox (RKToolbox). The RKToolbox is a collection of scientific computing tools based on rational Krylov techniques. The development started in 2013 and the current version 2.7 provides ˆ an implementation of Ruhe’s (block) rational Krylov sequence method [8, 9], allowing to control various options, including user-defined inner prod...

متن کامل

Block Algorithms with Augmented Rayleigh-ritz Projections for Large-scale Eigenpair Computation

Most iterative algorithms for eigenpair computation consist of two main steps: a subspace update (SU) step that generates bases for approximate eigenspaces, followed by a Rayleigh-Ritz (RR) projection step that extracts approximate eigenpairs. So far the predominant methodology for the SU step is based on Krylov subspaces that builds orthonormal bases piece by piece in a sequential manner. In t...

متن کامل

Locally Optimal and Heavy Ball GMRES Methods

The Generalized Minimal Residual method (GMRES) seeks optimal approximate solutions of linear system Ax = b from Krylov subspaces by minimizing the residual norm ‖Ax − b‖2 over all x in the subspaces. Its main cost is computing and storing basis vectors of the subspaces. For difficult systems, Krylov subspaces of very high dimensions are necessary for obtaining approximate solutions with desire...

متن کامل

Interpreting IDR as a Petrov--Galerkin Method

The IDR method of Sonneveld and van Gijzen [SIAM J. Sci. Comput., 31:1035–1062, 2008] is shown to be a Petrov-Galerkin (projection) method with a particular choice of left Krylov subspaces; these left subspaces are rational Krylov spaces. Consequently, other methods, such as BiCGStab and ML(s)BiCGStab, which are mathematically equivalent to some versions of IDR, can also be interpreted as Petro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013